A New Approach of Query Optimization with Join of N Relations

An important subject in integration of information in the large scale is to select Topic with a view to ranking from multiple sources so that transfer cost is become minimum. For this purpose in relations join, the suitable size of relations inputs for getting Top K must be determined. We are presenting in this article, according to the quantity k that is determined in query, a dynamic algorithm for determining input size of N relations in rank aware Queries in the from of hierarchical description that in this case we can efficiently answer to the queries with join of N relations for getting Top K. we implemented suggested algorithm and it is observed according to the gotten results that the amount of sent information by pruned records extraordinarily will be decreased in comparison with traditional algorithm and also the time of query processing extraordinarily will be decreased.